Ants for Sampling in the Nested Partition Algorithm
نویسنده
چکیده
The Nested Partition algorithm suffers from the lack of information gathering and sharing despite the computational effort dedicated to sampling the different subregions at each step of the algorithm. It is also noticed that the solution quality of the NP algorithm largely depends on the quality of the samples generated. Ants are used in this work as a mean to improve the samples quality through information building and sharing to solve the Traveling Salesman Problem TSP. Some of the samples are found in this hybrid algorithm using the Max-Min Ant System MMAS while other samples are generated by perturbing the ants’ tours.
منابع مشابه
Preliminary Results For Computation of the Grand Canonical Partition Function Using Nested Sampling
2 Computing the Partition Function From Nested Sampling The μVT system enforces a constant chemical potential, constant volume, and constant temperature. Unlike the the canonical or isothermal-isobaric systems the μVT system is allowed to exchange particles with the external bath, i.e. the number of particles within the constant volume of our system is allowed to change. The partition function ...
متن کاملDevelopment of PSPO Simulation Optimization Algorithm
In this article a new algorithm is developed for optimizing computationally expensive simulation models. The optimization algorithm is developed for continues unconstrained single output simulation models. The algorithm is developed using two simulation optimization routines. We employed the nested partitioning (NP) routine for concentrating the search efforts in the regions which are most like...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملAdvances in Markov chain Monte Carlo methods
Probability distributions over many variables occur frequently in Bayesian inference, statistical physics and simulation studies. Samples from distributions give insight into their typical behavior and can allow approximation of any quantity of interest, such as expectations or normalizing constants. Markov chain Monte Carlo (MCMC), introduced by Metropolis et al. (1953), allows sampling from d...
متن کامل